Domino Tatami Covering Is NP-Complete
نویسندگان
چکیده
A covering with dominoes of a rectilinear region is called tatami if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering. As a consequence it is NP-complete to decide whether there is a perfect matching of a graph that meets every 4-cycle, even if the graph is restricted to be an induced subgraph of the grid-graph. The gadgets used in the reduction were discovered with the help of a SAT-solver.
منابع مشابه
Tatami Maker: A combinatorially rich mechanical game board
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectilinear grids. We describe a modular, mechanical game board, prototyped with a desktop 3D printer, that enforces this restriction, and transforms tatami pen-andpaper puzzles into interactive sculptures. We review some r...
متن کاملMonomer-Dimer Tatami Tilings of Rectangular Regions
In this paper we consider tilings of rectangular regions with two types of tiles, 1× 2 tiles (dimers) and 1× 1 tiles (monomers). The tiles must cover the region and satisfy the constraint that no four corners of the tiles meet; such tilings are called tatami tilings. We provide a structural characterization and use it to prove that the tiling is completely determined by the tiles that are on it...
متن کاملAuspicious Tatami Mat Arrangements
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly speaking, we are considering are tilings of rectilinear regions with 1×2 dimer tiles and 1×1 monomer tiles, with the constraint that no four corners of the tiles meet. Typical problems are to minimize the number of monome...
متن کاملCMOS Design of Low Power High Speed NP Domino Logic
A low cost design and simple to implement, CMOS NP Domino logic is presented. The NP Domino logic designs require fewer transistors and are compatible with full Domino logic. The performance of NP Domino logic is also better compared to the standard Domino logic implementations. Dynamic domino logic are very good but had many challenges like monotonicity, leakage, charge sharing and noise probl...
متن کاملDomino Treewidth
We consider a special variant of tree-decompositions, called domino treedecompositions, and the related notion of domino treewidth. In a domino tree-decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every k, d, there exists a constant ck;d such that a graph with treewidth at most k and maximum degree at most d has domino treewidth at most ck;d. ...
متن کامل